Robust video-on-demand streaming in peer-to-peer environments

نویسندگان

  • Tai T. Do
  • Kien A. Hua
  • Mounir A. Tantaoui
چکیده

This paper presents a new video-on-demand streaming technique in peer-to-peer (P2P) environments. While a number of P2P live video streaming techniques have been proposed in the past, we argue that the two types of video streaming, live and on-demand, have some subtle differences. Most notably, a P2P video-on-demand streaming technique has to handle the asynchronous arrival of peers efficiently, and provide robust recovery under the rather frequent peers’ failure. Our answer to the challenge is an application multicast tree, called P2VoD (Peer-To-peer for Video-On-Demand streaming). P2VoD proposes a number of ideas, including a caching scheme, a generation concept, and a distributed directory service. Through analytical analysis, we show that P2VoD is sound and efficient. We also compare P2VoD against a recently proposed P2Cast system by Guo et al. [Y. Guo, K. Suh, J.F. Kurose, D.F. Towsley, P2cast: peer-topeer patching scheme for vod service., in: WWW, 2003, pp. 301–309] using both analytical analysis and simulation. The result shows that P2VoD performs better than P2Cast in a number of important performance metrics. Published by Elsevier B.V.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A survey on peer-to-peer video streaming systems

Video-over-IP applications have recently attracted a large number of users on the Internet. Traditional clientserver based video streaming solutions incur expensive bandwidth provision cost on the server. Peer-to-Peer (P2P) networking is a new paradigm to build distributed network applications. Recently, several P2P streaming systems have been deployed to provide live and on-demand video stream...

متن کامل

Darmstadt University of Technology P2P Streaming using Hierarchically Layer Encoded Video

Recently, peer-to-peer applications have become very popular in the Internet. In most cases they are used for file sharing purposes, like the exchange of MP3 files introduced by Napster [1] and evolved by its successors (e.g. Gnutella [2]). The mechanisms these applications are based on work fine for file sharing due to the elastic traffic characteristics. This is not the case for on-demand vid...

متن کامل

Video streaming over P2P networks: Challenges and opportunities

A robust real-time video communication service over the Internet in a distributed manner is an important challenge, as it influences not only the current Internet structure but also the future Internet evolution. In this context, Peer-to-Peer (P2P) networks are playing an imperative position for providing efficient video transmission over the Internet. Recently, several P2P video transmission s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Communications

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2008